A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Jasmin Christian Blanchette1,2 , Mathias Fleury2 , and Christoph Weidenbach2 1 2

Source URL: people.mpi-inf.mpg.de

• Formal methods
• Automated theorem proving
• Logic in computer science
• Boolean algebra
• Electronic design automation
• Conflict-Driven Clause Learning
• Boolean satisfiability problem
• Satisfiability modulo theories
• Clause
• Vampire
• Propositional calculus
• Lambda calculus

Recombinable Game Mechanics for Automated Design Support

Source URL: www.kmjn.org

• Leisure
• Game design
• Gaming
• Video game design
• Logic in computer science
• Theoretical computer science
• Video game development
• Game mechanics
• Event calculus
• Calculus
• Axiom
• Platform game

Automated Program Repair in an Integrated Development Environment Yu Pei, Carlo A. Furia, Martin Nordio, Bertrand Meyer Chair of Software Engineering, Department of Computer Science, ETH Zurich, Switzerland Email: first

Source URL: se.inf.ethz.ch

• Software testing
• Object-oriented programming
• Integrated development environments
• Compilers
• EiffelStudio
• Extreme programming
• Random testing
• Eiffel
• Software bug
• Unit testing
• Computer programming
• Design by contract

Logic for Automated Mechanism Design — A Progress Report Michael Wooldridge∗ Thomas Agotnes† ∗

Source URL: folk.uib.no

• Game theory
• Artificial intelligence
• Formal epistemology
• Modal logic
• Logic in computer science
• Common knowledge
• Epistemic modal logic
• Intelligent agent
• Alternating-time Temporal Logic
• Temporal logic
• Social software
• Mechanism design

CTP-based programming languages ? Considerations about an experimental design Florian Haftmann Cezary Kaliszyk

Source URL: dream.inf.ed.ac.uk

• Theoretical computer science
• Automated theorem proving
• Logic in computer science
• Proof assistants
• Formal methods
• Isabelle
• Type theory
• HOL
• Automated reasoning
• Computer algebra system
• Vienna Development Method
• Software development

Mostly-Automated Verification of Low-Level Programs in Computational Separation Logic Adam Chlipala Harvard University PLDI 2011

Source URL: adam.chlipala.net

• Theoretical computer science
• Logic in computer science
• Formal methods
• Constraint programming
• Electronic design automation
• Satisfiability modulo theories
• Separation logic
• Mathematical logic
• Logic programming
• Logic

Scheduling Issues Arising from Automated Real-Time System Design David J. Musliner Institute for Advanced Computer Studies The University of Maryland College Park, MD 20742

Source URL: musliner.com

Accelerating lemma learning using joins - DPLL(t) Nikolaj Bjørner Microsoft Research Bruno Dutertre SRI International

Source URL: yices.csl.sri.com

• Theoretical computer science
• Mathematical logic
• Automated theorem proving
• Mathematics
• Formal methods
• Logic in computer science
• Constraint programming
• Electronic design automation
• Conflict-Driven Clause Learning
• DPLL algorithm
• Boolean satisfiability problem
• Satisfiability modulo theories

LNCSA Tutorial on Satisfiability Modulo Theories

Source URL: yices.csl.sri.com

• Theoretical computer science
• Mathematical logic
• Mathematics
• Constraint programming
• Automated theorem proving
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• DPLL algorithm
• Symbol
• Conjunctive normal form

Design and Construction of an Automated Community Bicycle Loan/Return System Richard Lopez, Kenneth Roland Womack, Mark Goadrich and Troy C. Messina Centenary College of Louisiana, Departments of Math, Computer Science,

Source URL: mark.goadrich.com